Lossless quantum data compression and variable-length coding

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Lossless Quantum Data Compression and Quan- tum Variable–Length Codes

In Shannon’s Foundation of Information Theory ([27]) perhaps the most basic contributions are Source Coding Theorems (lossy and lossless) and the Channel Coding Theorem. In the most natural and simple source model DMS the source outputs a sequence X1, X2, . . . of independent, identically distributed random variables taking finitely many values. The Lossy Source Coding Theorem says that this se...

متن کامل

Quantum universal variable-length source coding

We construct an optimal quantum universal variable-length code that achieves the admissible minimum rate, i.e., our code is used for any probability distribution of quantum states. Its probability of exceeding the admissible minimum rate exponentially goes to 0. Our code is optimal in the sense of its exponent. In addition, its average error asymptotically tends to 0.

متن کامل

Notes on Lossless Data Compression and Huffman Coding

It is convenient to minimize the space needed to store data. Larger files will take longer to transfer over a data link, and will more quickly fill up disk quotas. Data compression techniques such as those used in common compression utilities allow reducing file sizes by exploiting redundancies in the data contained in them. Lossless coding techniques do this without compromising any informatio...

متن کامل

P2.1 Lossless Coding and Compression of Radar Reflectivity Data

The coding and compression of weather imagery can be improved by following a domain-specific approach in which the characteristics of the data are taken into account in devising the encoding scheme. We show that by predicting that the next valid data element is identical to the current one, a dramatic reduction in source entropy (information content) is achieved. We also show that encoding runs...

متن کامل

Lossless Compression of Seismic Data into Fixed-Length Packets

We present an algorithm to losslessly compress a sequence of integers. The intended application is to encode seismic data at nodes in a network of seismometers. The algorithm performs predictive compression, using adaptive linear filtering to predict sample values and encoding variable numbers of samples into fixed-length packets. To accommodate packet losses, the packets include sufficient ove...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review A

سال: 2002

ISSN: 1050-2947,1094-1622

DOI: 10.1103/physreva.65.032313